Hierarchical decomposition of domains with fractures

نویسندگان

  • Susanna Gebauer
  • Ralf Kornhuber
  • Harry Yserentant
چکیده

We consider the efficient and robust numerical solution of elliptic problems with jumping coefficients occurring on a network of thin fractures. We present an iterative solution concept based on a hierarchical separation of the fractures and the surrounding rock matrix. Upper estimates for the convergence rates are independent of the width of the fractures and of the jumps of the coefficients. Inexact solution of the local subproblems is also considered. The theoretical results are illustrated by numerical experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quadtree and Octree Grid Generation

Engineering analysis often involves the accurate numerical solution of boundary value problems in discrete form. Hierarchical quadtree (or octree) grid generation offers an efficient method for the spatial discretisation of arbitrary-shaped two- (or three-) dimensional domains. It consists of recursive algebraic splitting of sub-domains into quadrants (or cubes), leading to an ordered hierarchi...

متن کامل

Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members

Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...

متن کامل

Quasi-Primary Decomposition in Modules Over Proufer Domains

In this paper we investigate decompositions of submodules in modules over a Proufer domain into intersections of quasi-primary and classical quasi-primary submodules. In particular, existence and uniqueness of quasi-primary decompositions in modules over a Proufer domain of finite character are proved. Proufer domain; primary submodule; quasi-primary submodule; classical quasi-primary; decompo...

متن کامل

The Reliable Hierarchical Location-allocation Model under Heterogeneous Probabilistic Disruptions

This paper presents a novel reliable hierarchical location-allocation model where facilities are subject to the risk of disruptions. Based on the relationship between various levels of system, a multi-level multi-flow hierarchy is considered. The heterogeneous probabilistic disruptions are investigated in which the constructed facilities have different site-dependent and independent failure rat...

متن کامل

Accelerated decomposition techniques for large discounted Markov decision processes

Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 75  شماره 

صفحات  -

تاریخ انتشار 2006